A priori computation of the number of surface subdivision levels
نویسندگان
چکیده
Subdivision surfaces are a powerful model widely used in geometric modelling. Controlling the accuracy of the approximation of the limit surface often involves the computation of the distance between the control mesh and the limit surface. Nevertheless, the a priori level (or depth) of subdivision based on a distance criterion has not yet been expressed. The goal of this paper is thus to compute this level. Then the surface can be subdivided with a given accuracy without any distance computation between the subdivision surface and the limit surface.
منابع مشابه
A priori Computation of a mesh size for Adaptive Loop Subdivision
Subdivision schemes provide efficient algorithms both for the design and processing of arbitrary control meshes. Theoretically, these techniques are often considered as an elegant algorithmic way to approximate a desired surface from a given surface. In practice, controlling the accuracy of control meshes with regard to the limit surface remains difficult. In this paper, from a bound of the dis...
متن کاملEecient Calculation of Subdivision Surfaces for Visualization
A subdivision surface is deened by a polygonal mesh which is iteratively re-ned into an innnite sequence of meshes converging to the desired smooth surface. Classical subdivision schemes are those described and analyzed by Cat-mull/Clark and Doo/Sabin. A graphical representation can be obtained by stopping the iteration on a level of reenement suucient to yield a smooth representation when draw...
متن کاملTotal Roman domination subdivision number in graphs
A {em Roman dominating function} on a graph $G$ is a function $f:V(G)rightarrow {0,1,2}$ satisfying the condition that every vertex $u$ for which $f(u)=0$ is adjacent to at least one vertex $v$ for which $f(v)=2$. A {em total Roman dominating function} is a Roman dominating function with the additional property that the subgraph of $G$ induced by the set of all vertices of positive weight has n...
متن کاملEternal m-security subdivision numbers in graphs
An eternal $m$-secure set of a graph $G = (V,E)$ is aset $S_0subseteq V$ that can defend against any sequence ofsingle-vertex attacks by means of multiple-guard shifts along theedges of $G$. A suitable placement of the guards is called aneternal $m$-secure set. The eternal $m$-security number$sigma_m(G)$ is the minimum cardinality among all eternal$m$-secure sets in $G$. An edge $uvin E(G)$ is ...
متن کاملThe convex domination subdivision number of a graph
Let $G=(V,E)$ be a simple graph. A set $Dsubseteq V$ is adominating set of $G$ if every vertex in $Vsetminus D$ has atleast one neighbor in $D$. The distance $d_G(u,v)$ between twovertices $u$ and $v$ is the length of a shortest $(u,v)$-path in$G$. An $(u,v)$-path of length $d_G(u,v)$ is called an$(u,v)$-geodesic. A set $Xsubseteq V$ is convex in $G$ ifvertices from all $(a, b)$-geodesics belon...
متن کامل